A New Attack on Random Pronounceable Password Generators Ganesan and Davies A New Attack on Random Pronounceable Password Generators

نویسندگان

  • Ravi Ganesan
  • Chris Davies
چکیده

Given the choice, most users pick poor passwords that are vulnerable to attack. Using random machine generated passwords can ensure that ‘good’ passwords are chosen, but are user-unfriendly. Machine generated passwords which are ‘pronounceable’ represent a potential compromise between security considerations and user friendliness. Several such generators have been designed, perhaps the most prominent being the scheme developed by Morrie Gasser [5] in 1977 and which has being recently adopted as a standard by NIST [3]. The security of such generators is typically characterized by the overall size of the password space, which is typically a fairly large number. This is a fairly good security parameter, if the objective of the attacker is to try and compromise a particular account. On the other hand, if an attacker achieves her objective by compromising any account(s) on the system, then the overall size of the password space, in itself, provides an insufficient characterization of the level of security. In fact, as we show in this work, the size of the password space of the pronounceable password generators we examined are fairly huge, yet all suffer from a serious weakness, which allows the attacker to compromise accounts on the system with significantly less effort than the size of the password space would suggest. The attacker cannot choose which accounts to compromise, but in many realistic situations, an attacker’s objectives can be met by compromising any account(s). Conceptually, the password space can be thought of as a large bucket, of size , from which users pick passwords. It is also true that one can arbitrarily partition this bucket into several smaller buckets, perhaps of different sizes. Consider a small bucket of size . It might be natural to assume that exactly of the users would pick passwords from this bucket. Unfortunately, in the pronounceable password generators we examine in this work, it so happens that a disproportionately large number of users pick passwords from reasonably small buckets. For instance, in the NIST standard, one such bucket contains only 0.22% of all passwords but it can be expected that about 5% of all users pick passwords from this bucket. The bottomline is that while the NIST standard claims a password space size of “5.7 billion” for 8 character passwords, an attacker who wishes to compromise any 5 user accounts on a multiuser system with a 100 users, need only search through less than 18 million passwords. The impact of the attack depends on the particular implementation and on factors such as ‘salting’. Nevertheless, the generators we examined are so acutely vulnerable to our new attack, that we do not recommend that they be used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic Attacks Against Graphical Password Generators

In this paper we explore heuristic attacks against graphical password generators. A new trend is emerging to use user clickable pictures to generate passwords. This technique of authentication can be successfully used for for example operating system authentication. We report on the development of a generic tool for password generation using such a graphical click-driven interface. This stand-a...

متن کامل

Efficient Password-Based Authenticated Key Exchange Without Public Information

Since the first password-based authenticated key exchange (PAKE) was proposed, it has enjoyed a considerable amount of interest from the cryptographic research community. To our best knowledge, most of proposed PAKEs based on Diffie-Hellman key exchange need some public information, such as generators of a finite cyclic group. However, in a client-server environment, not all servers use the sam...

متن کامل

An Enhanced Password-based Group Key Agreement Protocol with Constant Rounds

In PKC 2006, Abdalla et al. proposed a password-based group key exchange protocol with constant rounds and proved that protocol could resist the offline dictionary attacks in the random-oracle and ideal-cipher models. Then they proposed an open problem whether an adversary can test more than one password in the same session with online dictionary attack. To answer this question, they presented ...

متن کامل

Preventing Shoulder-Surfing Attack with the Concept of Concealing the Password Objects' Information

Traditionally, picture-based password systems employ password objects (pictures/icons/symbols) as input during an authentication session, thus making them vulnerable to "shoulder-surfing" attack because the visual interface by function is easily observed by others. Recent software-based approaches attempt to minimize this threat by requiring users to enter their passwords indirectly by performi...

متن کامل

New Approaches to Password Authenticated Key Exchange Based on RSA

We investigate eÆcient protocols for password-authenticated key exchange based on the RSA public-key cryptosystem. To date, most of the published protocols for password-authenticated key exchange were based on DiÆe-Hellman key exchange. It seems diÆcult to design eÆcient password-authenticated key exchange protocols using RSA and other public-key cryptographic techniques. In fact, many of the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994